On Indecomposability Preserving Elimination Sequences

نویسندگان

  • Chandan K. Dubey
  • Shashank K. Mehta
چکیده

A module of a graph is a non-empty subset of vertices such that every non-module vertex is either connected to all or none of the module vertices. An indecomposable graph contains no non-trivial module (modules of cardinality 1 and |V | are trivial). We present an algorithm to compute indecomposability preserving elimination sequence, which is faster by a factor of |V | compared to the algorithms based on earlier published work. The algorithm is based on a constructive proof of Ille’s theorem [9]. The proof uses the properties of X-critical graphs, a generalization of critical indecomposable graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indecomposability of polynomials and related Diophantine equations

We present a new criterion for indecomposability of polynomials over Z. Using the criterion we obtain general finiteness result on polynomial Diophantine equation f(x) = g(y).

متن کامل

On the indecomposability of polynomials

Applying a combinatorial lemma a new sufficient condition for the indecomposability of integer polynomials is established.

متن کامل

Indecomposability of R and R\{0} in Constructive Reverse Mathematics

It is shown that —over Bishop's constructive mathematics— the indecomposability of R is equivalent to the statement that all functions from a complete metric space into a metric space are sequentially nondiscontinuous. Furthermore we prove that the indecomposability of R \ {0} is equivalent to the negation of the disjunctive version of Markov's Principle. These results contribute to the program...

متن کامل

Deciding Irreducibility/Indecomposability of Feedback Shift Registers is NP-hard

Feedback shift registers(FSRs) are a fundamental component in electronics and secure communication. An FSR f is said to be reducible if all the output sequences of another FSR g can also be generated by f and the FSR g has less memory than f . An FSR is said to be decomposable if it has the same set of output sequences as a cascade connection of two FSRs. It is proved that deciding whether FSRs...

متن کامل

Indecomposability of Polynomials via Jacobian Matrix

Indecomposable polynomials are a special class of absolutely irreducible polynomials. Some improvements of important effective results on absolute irreducibility have recently appeared using Ruppert’s matrix. In a similar way, we show in this paper that the use of a Jacobian matrix gives sharp bounds for the indecomposability problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006